Adaptive Facial Imagery Clustering via Spectral Clustering and Reinforcement Learning

نویسندگان

چکیده

In an era of big data, face images captured in social media and forensic investigations, etc., generally lack labels, while the number identities (clusters) may range from a few dozen to thousands. Therefore, it is practical importance cluster large unlabeled into efficient or even exact identities, which can avoid image labeling by hand. Here, we propose adaptive facial imagery clustering that involves representations, spectral clustering, reinforcement learning (Q-learning). First, use deep convolutional neural network (DCNN) generate adopt model construct similarity matrix achieve partition. Then, internal evaluation measure (the Davies–Bouldin index) evaluate quality. Finally, Q-learning as feedback module build dynamic multiparameter debugging process. The experimental results on ORL Face Database show effectiveness our method terms optimal clusters 39, almost actual 40 clusters; 99.2% accuracy. Subsequent studies should focus reducing computational complexity dealing with more images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Clustering: Better Representatives with Reinforcement Learning

Adaptive clustering uses reinforcement learning to learn the reward values of successive data clusterings. Adaptive clustering applies when external feedback exists for a clustering task. It supports the reuse of clusterings by memorizing what worked well in a previous context. It explores multiple paths in a reinforcement learning environment when the goal is to find better cluster representat...

متن کامل

Clustering with Reinforcement Learning

We show how a previously derived method of using reinforcement learning for supervised clustering of a data set can lead to a sub-optimal solution if the cluster prototypes are initialised to poor positions. We then develop three novel reward functions which show great promise in overcoming poor initialization. We illustrate the results on several data sets. We then use the clustering methods w...

متن کامل

Deep Spectral Clustering Learning

Clustering is the task of grouping a set of examples so that similar examples are grouped into the same cluster while dissimilar examples are in different clusters. The quality of a clustering depends on two problem-dependent factors which are i) the chosen similarity metric and ii) the data representation. Supervised clustering approaches, which exploit labeled partitioned datasets have thus b...

متن کامل

Learning Spectral Clustering

Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same cluster having high similarity and points in different clusters having low similarity. In this paper, we derive a new cost function for spectral clustering based on a measure of error between a given partition and a solut...

متن کامل

Reinforcement Learning Task Clustering (RLTC)

This work represents the first step towards a task library system in the reinforcement learning domain. Task libraries could be useful in speeding up the learning of new tasks through task transfer. Related transfer can increase learning rate and can help prevent convergence to sub-optimal policies in reinforcement learning. Unrelated transfer can be extremely detrimental to the learning rate. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2021

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app11178051